class Solution1328 {
    public String breakPalindrome(String palindrome) {
        if(palindrome == null || palindrome.length() == 0 || palindrome.length() == 1 ) return "" ; 
        int len = palindrome.length() ;
        char[] arr = palindrome.toCharArray() ;
        boolean[][] dp = new boolean[len][len] ; 
        for(int i=len-1 ; i >= 0 ; i --){
            for(int j=i ; j < len  ; j ++){
              if(arr[i] == arr[j]){
                 if(i == j || i+1 == j){
                   dp[i][j] = true ;
                 }else{
                  dp[i][j] = dp[i+1][j-1] ; 
                 }
              }else{
                dp[i][j] = false ;
              }
            }
        }
        for(int i=0 ;i < len ; i ++){
            for(int j='a' ; j <='z' ; j ++ ){
                   if(j < arr[i]){
                    if(i != len-i-1){
                       arr[i] = (char) j; 
                       return new String(arr) ; 
                    }
                   }else{
                    break ;
                   }
                }
            }
           arr[len-1] ++ ; 
        return new String(arr) ;
        } 
    

               
     
}